COMPARISON OF HASH STRATEGIES FOR FLOW-BASED LOAD BALANCING
نویسندگان
چکیده
منابع مشابه
Comparison of Load Balancing Strategies on Cluster-based Web Servers
This paper focuses on an experimental analysis of the performance and scalability of cluster-based web servers. We carry out the comparative studies using two experimental platforms, namely, a hardware testbed consisting of 16 PCs, and a trace-driven discrete-event simulator. Dispatcher and web server service times used in the simulator are determined by carrying out a set of experiments on the...
متن کاملComparison of Load Balancing Strategies on Cluster-based Web Servers
Sweden This paper focuses on an experimental analysis of the performance and scalability of cluster-based web servers. We carry out the comparative studies using two experimental platforms, namely, a hardware testbed consisting of sixteen PCs, and a trace-driven discrete-event simulator. Dispatcher and web server service times used in the simulator are determined by carrying out a set of experi...
متن کاملComparison of Dynamic Load Balancing Strategies
Wa90] A. Wagener: Lastverteilungsstrategien und Netzwerktopologien f ur eine Rea-lisierung der parallelen abstrakten Maschine PAM, Master thesis, RWTH Aa-chen, 1990, (in german) run times are not very fast (see table 4), but this is of minor importance. We are mainly interested in the speedups, which are possible using a certain load balancing strategy. Nevertheless, a modiied compiler which pr...
متن کاملSimple Load Balancing for Distributed Hash Tables
Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argue in this paper that these goals can be achieved more simply and more cost-e ectively. First, we ...
متن کاملPerformance Comparison of Dynamic Load-Balancing Strategies for Distributed Computing
The DASUD (Diffusion Algorithm Searching Unbalanced Domains) algorithm belongs to the nearestneighbours class and operates in a diffusion scheme where a processor balances its load with all its neighbours. DASUD detects unbalanced domains and performs local exchange of load between processors to achieve global balancing. The DASUD algorithm has been evaluated by comparison with another well-kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronic Commerce Studies
سال: 2015
ISSN: 2073-9729
DOI: 10.7903/ijecs.1346